منابع مشابه
On the Zagreb and Eccentricity Coindices of Graph Products
The second Zagreb coindex is a well-known graph invariant defined as the total degree product of all non-adjacent vertex pairs in a graph. The second Zagreb eccentricity coindex is defined analogously to the second Zagreb coindex by replacing the vertex degrees with the vertex eccentricities. In this paper, we present exact expressions or sharp lower bounds for the second Zagreb eccentricity co...
متن کاملAmenable groups and measure concentration on spheres
It is proved that a discrete group G is amenable if and only if for every unitary representation of G in an infinite-dimensional Hilbert space H the maximal uniform compactification of the unit sphere SH has a G-fixed point, that is, the pair (SH, G) has the concentration property in the sense of Milman. Consequently, the maximal U(H)equivariant compactification of the sphere in a Hilbert space...
متن کاملOn measure concentration of vector valued maps
In this work, we study concentration properties for vector valued maps. In particular, we describe inequalities which capture the exact dimensional behavior of Lipschitz maps with values in Rk. To this task, we study in particular a domination principle for projections which might be of independent interest. We further compare our conclusions to earlier results by Pinelis in the Gaussian case, ...
متن کاملSketch notes on concentration of measure
I have written these notes to accompany my first two tutorial lectures on concentration of measure given at IPAM during March 20–23, 2018. I intend the lectures to be quite basic, so they will miss out many large and important topics related to concentration. These notes are a guide to my lectures and to further reading, so only a few proofs are given in full here. I am grateful to a number of ...
متن کاملOn Stability and Concentration of Measure
Stability conditions can be thought of as a way of controlling the variance of the learning process. Strong stability conditions additionally imply concentration of certain quantities around their expected values. It was shown recently that stability of learning algorithms is closely related to their generalization and consistency. In this paper we examine stability conditions from this point o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lietuvos matematikos rinkinys
سال: 2009
ISSN: 2335-898X,0132-2818
DOI: 10.15388/lmr.2009.78